Compressing Inverted Index Using Optimal FastPFOR
نویسندگان
چکیده
منابع مشابه
Compressing Inverted Index Using Optimal FastPFOR
Indexing plays an important role for storing and retrieving the data in Information Retrieval System (IRS). Inverted Index is the most frequently used indexing structure in IRS. In order to reduce the size of the index and retrieve the data efficiently, compression schemes are used, because the retrieval of compressed data is faster than uncompressed data. High speed compression schemes can imp...
متن کاملCompressing Inverted Lists
The performance of Information Retrieval systems is a key issue in large web search engines. The use of inverted indexes and compression techniques is partially accountable for the current performance achievement of web search engines. In this paper, we introduce a new class of compression techniques for inverted indexes, the Adaptive Frame of Reference, that provides fast query response time, ...
متن کاملCompressing Vector Quantization Index Table Using Side Match State Codebook
In the memoryless vector quantization scheme, each image block is independently encoded as a corresponding index and then an index table will be generated. In this paper, we apply the side match concept and propose a new scheme, which can further compress the index table without introducing extra encoding distortion. Our scheme exploits the characteristic that the blocks of images are highly co...
متن کاملInverted Index Compression
The data structure at the core of nowadays large-scale search engines, social networks and storage architectures is the inverted index, which can be regarded as being a collection of sorted integer sequences called inverted lists. Because of the many documents indexed by search engines and stringent performance requirements dictated by the heavy load of user queries, the inverted lists often st...
متن کاملI Inverted Index Compression
The data structure at the core of nowadays largescale search engines, social networks, and storage architectures is the inverted index. Given a collection of documents, consider for each distinct term t appearing in the collection the integer sequence `t , listing in sorted order all the identifiers of the documents (docIDs in the following) in which the term appears. The sequence `t is called ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2015
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.23.185